Topological quadrangulations of closed triangulated surfaces using the Reeb graph
نویسندگان
چکیده
منابع مشابه
Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph
Although surfaces are more and more often represented by dense triangulations, it can be useful to convert them to B-spline surface patches, lying on quadrangles. This paper presents a method for the construction of coarse topological quadrangulations of closed triangulated surfaces, based on Morse theory. In order to construct on the surface a quadrangulation of its canonical polygonal schema,...
متن کاملTopological Morphing Using Reeb Graphs
Metamorphosis between 3D objects is often the transformation between a pair of shapes that have the same topology. This paper presents a new model using Reeb graphs and their contours to create morphing between 3D objects having different topology. The proposed method specifies the correspondence between of the input objects by using the graph isomorphic theory. Then the super Reeb graph, which...
متن کاملSimplification of Large, Closed Triangulated Surfaces Using Atomic Envelopes
Over the past two decades, data visualization has become increasingly important in several fields, including medical, fluid flow and geographical data. The speed of visualization algorithms has unfortunately not kept up with the speed of developing new technology producing high-resolution data. Every year, the quality of imaging and computational simulation technology — including laser scanners...
متن کاملSimpli cation of Closed Triangulated Surfaces Using Simulated Annealing
We describe a method to approximate a closed surface triangulation using simulated annealing. Our approach guarantees that all vertices and triangles in an approximating surface triangulation are within a user-de ned distance of the original surface triangulation. We introduce the idea of atomic envelopes to guarantee error bounds that are independent of the surface geometry. Atomic envelopes a...
متن کاملMaintaining Reeb Graphs of Triangulated 2-Manifolds
Let M be a triangulated, orientable 2-manifold of genus g without boundary, and let h be a height function over M that is linear within each triangle. We present a kinetic data structure (KDS) for maintaining the Reeb graph R of h as the heights of M’s vertices vary continuously with time. Assuming the heights of two vertices of M become equal only O(1) times, the KDS processes O((κ + g)n polyl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphical Models
سال: 2003
ISSN: 1524-0703
DOI: 10.1016/s1524-0703(03)00005-5